Evaluation of The Performance of Butterfly Optimization Algorithm in Solving High-Dimensional Numerical Optimization Problems
نویسندگان
چکیده
The butterfly optimization algorithm is one of the metaheuristic algorithms that models foraging behavior butterflies. It appears in literature it has been used successfully solution many problems. Control parameters and dimension problem directly affect performance a algorithm. When possible problems are evaluated, some may be low-dimensional, while others high-dimensional. At same time, expected successful on high-dimensional as well. In this study, evaluated solving numerical compared with artificial bee colony algorithm, harmony search flower pollination Wilcoxon signed-rank test to analyze significance results. results show generally more than other
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملSolving the Unconstrained Optimization Problems Using the Combination of Nonmonotone Trust Region Algorithm and Filter Technique
In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems that is equipped with the filter technique. In the proposed method, the various nonmonotone technique is used. Using this technique, the algorithm can advantage from nonmonotone properties and it can increase the rate of solving the problems. Also, the filter that is used in...
متن کاملA Finite Algorithm for Solving Infinite Dimensional Optimization Problems
We consider the general optimization problem (P ) of selecting a continuous function x over a σ -compact Hausdorff space T to a metric space A, from a feasible region X of such functions, so as to minimize a functional c on X. We require that X consist of a closed equicontinuous family of functions lying in the product (over T ) of compact subsets Yt of A. (An important special case is the opti...
متن کاملSolving optimization problems using black hole algorithm
Various meta-heuristic optimization approaches have been recently created and applied in different areas. Many of these approaches are inspired by swarm behaviors in the nature. This paper studies the solving optimization problems using Black Hole Algorithm (BHA) which is a population-based algorithm. Since the performance of this algorithm was not tested in mathematical functions, we have stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mühendislik bilimleri ve ara?t?rmalar? dergisi
سال: 2022
ISSN: ['2687-4415']
DOI: https://doi.org/10.46387/bjesr.1170933